On the Action of the Dual Group on the Cohomology of Perverse Sheaves on the Affine Grassmannian

It was proved by Ginzburg, Mirkovic and Vilonen that the G(O)-equivariant perverse sheaves on the affine Grassmannian of a connected reductive group G form a tensor category equivalent to the tensor category of finite dimensional representations of the dual group G . In this paper we construct explicitly the action of G on the global cohomology of a perverse sheaf.     

A Duality Theorem for Étale p-Torsion Sheaves on Complete Varieties over a Finite Field

Let X be an arbitrary variety over a finite field k and p=char k,n N. We will construct a complex of étale sheaves on X together with trace isomorphism from the highest étale cohomology group of this complex onto Z/pⁿZ such that for every constructible Z/pⁿZ-sheaf on X the Yoneda pairing is a nondegenerate pairing of finite groups. If X is smooth, this complex is the Gersten resolution of the logarithmic de Rham–Witt sheaf introduced by Gros and Suwa. The proof is based on the special case proven by Milne when the sheaf is constant and X is smooth, as well as on a purity theorem which in turn follows from a theorem about the cohomological dimension of C_i-fields due to Kato and Kuzumaki. If the existence of the Lichtenbaum complex is proven, the theorem will be the p-part of a general duality theorem for varieties over finite fields.     

A Note on Error Bounds for Convex and Nonconvex Programs

Given a single feasible solution and a single infeasible solution of a mathematical program, we provide an upper bound to the optimal dual value. We assume that satisfies a weakened form of the Slater condition. We apply the bound to convex programs and we discuss its relation to Hoffman-like bounds. As a special case, we recover a bound due to Mangasarian [11] on the distance of a point to a convex set specified by inequalities.     

Cyclic Cohomology of étale Groupoids: The General Case

We give a general method for computing the cyclic cohomology of crossed products by étale groupoids, extending the Feigin–Tsygan–Nistor spectral sequences. In particular we extend the computations performed by Brylinski, Burghelea, Connes, Feigin, Karoubi, Nistor, and Tsygan for the convolution algebra C _c (G) of an étale groupoid, removing the Hausdorffness condition and including the computation of hyperbolic components. Examples like group actions on manifolds and foliations are considered.     

SO(2) Symmetry of a Maxwell p-Form Theory

We find a universal SO(2) symmetry of a p-form Maxwell theory for both odd and even p. For odd p, it corresponds to the duality rotations but for even p, it defines a new set of transformations which is not related to duality rotations. In both cases, a symmetry group defines a subgroup of the O(2,1) group of R-linear canonical transformations which has also a natural representation on the level of quantization condition for p-brane dyons.     

Asymptotic properties of the fenchel dual functional and applications to decomposition problems

We study dual functionals which have two fundamental properties. Firstly, they have a good asymptotical behavior. Secondly, to each dual sequence of subgradients converging to zero, one can associate a primal sequence which converges to an optimal solution of the primal problem. Furthermore, minimal conditions for the convergence of the Gauss-Seidel methods are given and applied to such kinds of functionals.     

基于LAGRANGE插值的高阶微分中值定理

本文基于LAGRANGE插值，将微积分中非常重要的中值定理推广到了高阶的情形。     

半无限规划的一个对偶问题

本文对半无限凸规划提出一个新的对偶问题，使用扰动函数、次微分和法锥，文中证明了相应的弱对偶性及强对偶性的充要条件．     

Optimal filter design subject to output sidelobe constraints: Computational algorithm and numerical results

An algorithm is presented for the design of optimal detection filters in radar and communications systems, subject to inequality constraints on the maximum output sidelobe levels. This problem was reduced in an earlier paper (Ref. 1) to an unconstrained one in the dual space of regular Borel measures, with a nondifferentiable cost functional. Here, the dual problem is solved via steepest descent, using the directional Gateaux differential. The algorithm is shown to be convergent, and numerical results are presented.This research was supported by the Australian Research Grants Committee.